New method for renormalon subtraction using Fourier transform
نویسندگان
چکیده
To improve accuracy in calculating QCD effects, we propose a method for renormalon subtraction the context of operator-product expansion. The enables subtracting renormalons various powers $\Lambda_{\rm QCD}$ efficiently and simultaneously from single-scale observables. We apply it to different observables examine consistency with theoretical expectations.
منابع مشابه
A New Fourier Transform
In order to define a geometric Fourier transform, one usually works with either `-adic sheaves in characteristic p > 0 or with D-modules in characteristic 0. If one considers `-adic sheaves on the stack quotient of a vector bundle V by the homothety action of Gm, however, Laumon provides a uniform geometric construction of the Fourier transform in any characteristic. The category of sheaves on ...
متن کاملA New Method for Improving Robustness of Registered Fingerprint Data Using the Fractional Fourier Transform
Inspired by related studies, a new data processing method in fingerprint authentication using the fractional Fourier transform (FRT) was proposed for registered fingerprint data. In this proposal, protection of personal information was also taken into account. We applied the FRT instead of the conventional Fourier transform (FT) which has been used as one of the representative fingerprint authe...
متن کاملFourier transform interferometer alignment method.
A rapid and convenient method has been developed to facilitate the alignment of the image-plane components of point-diffraction interferometers, including the phase-shifting point-diffraction interferometer. In real time, the Fourier transform of the detected image is used to calculate a pseudoimage of the electric field in the image plane of the test optic where thecritical alignment o f vario...
متن کاملUsing the Fourier Transform
We give a quantum algorithm for solving a shifted multiplicative character problem over Z/nZ and finite fields. We show that the algorithm can be interpreted as a matrix factorization or as solving a deconvolution problem and give sufficient conditions for a shift problem to be solved efficiently by our algorithm. We also show that combining the shift problem with the hidden subgroup problem re...
متن کاملPruning fast Fourier transform algorithm design using group-based method
In this paper, we propose the grouped scheme, which can be specially applied to compute the pruning fast Fourier transform (pruning FFT) with power-of-two partial transformation length. The group-based pruning FFT algorithm applies the scheme of the grouped frequency indices to accelerate computations of selected discrete Fourier transform (DFT) outputs. The proposed pruning FFT algorithm has f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physics Letters B
سال: 2021
ISSN: ['0370-2693', '1873-2445']
DOI: https://doi.org/10.1016/j.physletb.2021.136414